Maximal orders having a discrete normalizing class group

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Crossed Product Orders over Discrete Valuation Rings

The problem of determining when a (classical) crossed product T = S ∗ G of a finite group G over a discrete valuation ring S is a maximal order, was answered in the 1960’s for the case where S is tamely ramified over the subring of invariants S. The answer was given in terms of the conductor subgroup (with respect to f) of the inertia. In this paper we solve this problem in general when S/S is ...

متن کامل

Maximal Orders in Semigroups1

Inspired by the ring theory concepts of orders and classical rings of quotients, Fountain and Petrich introduced the notion of a completely 0-simple semigroup of quotients in [19]. This was generalised to a much wider class of semigroups by Gould in [20]. The notion extends the well known concept of group of quotients [8]. To give the definition we first have to explain what is meant by a squar...

متن کامل

Polynomial Path Orders: A Maximal Model

This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order >pop∗. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feat...

متن کامل

Subexponential Class Group Computation in Quadratic Orders (abstract)

In 1989, the first subexponential algorithm for computing the class group of an imaginary quadratic order was introduced by Hafner and McCurley. Their algorithm is based on an integer factorization algorithm due to Seysen, and is conditional on the truth of the Extended Riemann Hypothesis. Not long after, their result was generalized to arbitrary algebraic number fields by Buchmann. Efficient v...

متن کامل

Discrete sets and the maximal totally bounded group topology*

Hart, K.P. and J. van Mill, Discrete sets and the maximal totally bounded group topology, Journal of Pure and Applied Algebra 70 (1991) 73-80. If G is an Abelian group, then G # is G with its maximal totally bounded group topology. We prove that every A c G# contains a closed (in G#) and discrete subset B such that lB1 = IAl. This answers a question posed by Eric van Douwen. We also present an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1986

ISSN: 0021-8693

DOI: 10.1016/0021-8693(86)90086-4